The Quantum PCP Conjecture
نویسندگان
چکیده
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop tools that address the question: does a quantum version of the PCP theorem hold? The story of this study starts with classical complexity and takes unexpected turns providing fascinating vistas on the foundations of quantum mechanics, the global nature of entanglement and its topological properties, quantum error correction, information theory, and much more; it raises questions that touch upon some of the most fundamental issues at the heart of our understanding of quantum mechanics. At this point, the jury is still out as to whether or not such a theorem holds. This survey aims to provide a snapshot of the status in this ongoing story, tailored to a general theory-of-CS audience.
منابع مشابه
A note about a partial no-go theorem for quantum PCP
This is not a disproof of the quantum PCP conjecture! In this note we use perturbation on the commuting Hamiltonian problem on a graph, based on results by Bravyi and Vyalyi, to provide a partial no-go theorem for quantum PCP. Specifically, we derive an upper bound on how large the promise gap can be for the quantum PCP still to hold, as a function of the non-commuteness of the system. As the s...
متن کاملPointer Quantum PCPs and Multi-Prover Games
The quantum PCP (QPCP) conjecture states that all problems in QMA, the quantum analogue of NP, admit quantum verifiers that only act on a constant number of qubits of a polynomial size quantum proof and have a constant gap between completeness and soundness. Despite an impressive body of work trying to prove or disprove the quantum PCP conjecture, it still remains widely open. The above-mention...
متن کاملCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking, and multiplayer games respectively. In the last lecture we formulated quantum analogues of the CSP and proof checking variants, and proved their equivalence. Today we introduce a quantum analogue of the games variant. Unlike the classical case, it is not known if this formulatio...
متن کاملAn almost sudden jump in quantum complexity
The Quantum Satisfiability problem (qsat) is the generalization of the canonical NP-complete problem Boolean Satisfiability. (k, s)-qsat is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on k qubits out of n qubits, such that each qubit appears in at most s projectors, decide whether there exists a quantum state in the null space of all the proje...
متن کاملLocally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of approximation. The conjecture is a strengthening of the PCP Theorem, predicting the existence of a special type of PCP veri ers: 2-query veri ers that only make unique tests. Moreover, the UGC predicts that such PCP veri ers can have almost-perfect completeness and low-soundnes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1309.7495 شماره
صفحات -
تاریخ انتشار 2013